RECOGNISING REE GROUPS USING THE CODEGREE SET
نویسندگان
چکیده
Abstract The codegree of an irreducible character $\chi $ a finite group G is $|G : \ker \chi |/\chi (1)$ . We show that the Ree ${}^2G_2(q)$ , where $q = 3^{2f+1}$ determined up to isomorphism by its set codegrees.
منابع مشابه
Recognising the small Ree groups in their natural representations
We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups G2(q) = Ree(q), where q = 3 for some m > 0, in their natural representations of degree 7. The input is a generating set X ⊂ GL(7, q). The constructive recognition algorithm is polynomial time given a discrete logarithm oracle. The constructive membership testing consists of a prepr...
متن کاملMatrix generators for the Ree groups
For the purposes of [K] and [KM] it became necessary to have 7× 7 matrix generators for a Sylow-3-subgroup of the Ree groups G2(q) and its normalizer. For example in [K] we wanted to show that in a seven dimensional representation the Jordan canonical form of any element of order nine is a single Jordan block of size 7. In [KM] we develop group recognition algorithms. At some stage we need to i...
متن کاملRecognising Groups among Dialects
In this paper we apply various clustering algorithms to the dialect pronunciation data. At the same time we propose several evaluation techniques that should be used in order to deal with the instability of the clustering techniques. The results have shown that three hierarchical clustering algorithms are not suitable for the data we are working with. The rest of the tested algorithms have succ...
متن کاملExponential Sums, Ree Groups and Suzuki Groups: Conjectures
ISSN: 1058-6458 (Print) 1944-950X (Online) Journal homepage: http://www.tandfonline.com/loi/uexm20 Exponential Sums, Ree Groups and Suzuki Groups: Conjectures Nicholas M. Katz To cite this article: Nicholas M. Katz (2017): Exponential Sums, Ree Groups and Suzuki Groups: Conjectures, Experimental Mathematics, DOI: 10.1080/10586458.2017.1334246 To link to this article: http://dx.doi.org/10.1080/1...
متن کاملThe Mobius function of the small Ree groups
The Möbius function for a group G was introduced in 1936 by Hall in order to count ordered generating sets of G. In this paper we determine the Möbius function of the simple small Ree groups, R(q) = G2(q) where q = 3 for m > 0, using their 2-transitive permutation representation of degree q + 1. We also describe their maximal subgroups in terms of this representation. We use this to enumerate s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The Australian Mathematical Society
سال: 2022
ISSN: ['0004-9727', '1755-1633']
DOI: https://doi.org/10.1017/s0004972722001022